Extraction de programmes dans le Calcul des Constructions. (Program Extraction in the Calculus of Constructions)
نویسنده
چکیده
منابع مشابه
Theorem Proving Support in Programming Language Semantics N° ???? Theorem Proving Support in Programming Language Semantics
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation. Descriptions as recursive functions are also provided whenever suitable, thus yielding a a verifica...
متن کاملTheorem proving support in programming language semantics
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational semantics, axiomatic semantics, and abstract interpretation. Descriptions as recursive functions are also provided whenever suitable, thus yielding a a verifica...
متن کاملFormalization of SLD-Resolution in the calculus of inductive constructions
This report presents a full formalization of the operational semantics of deenite programs (used in logic programming), given by SLD-Resolution. The variables renaming process used during a SLD-derivation is completely deened in an explicit manner. Furthermore, constructive proofs of two well known lemmas (lifting lemma and switching lemma) are built from this formalization in the calculus of i...
متن کاملDeveloping Certiied Programs in the System Coq the Program Tactic Developing Certiied Programs in the System Coq the Program Tactic
The system Coq is an environment for proof development based on the Calculus of Constructions extended by inductive deenitions. Functional programs can be extracted from constructive proofs written in Coq. The extracted program and its corresponding proof are strongly related. The idea in this paper is to use this link to have another approach: to give a program and to generate automatically th...
متن کاملExtracting Text from Proofs
In this paper, we propose a method for presenting formal proofs in an intelligible form. We describe a transducer from proof objects (terms in the Calculus of Constructions) to pseudo natural language that has been implemented for the Coq system Extraction de Texte a partir de Preuves R esum e : Ce papier pr esente une m ethode pour produire a partir de preuves formelles une explication textuel...
متن کامل